Waypoint Graph Based Fast Pathfinding in Dynamic Environment
نویسندگان
چکیده
منابع مشابه
dynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولFast Dynamic Graph Algorithms for Parameterized Problems
Fully dynamic graph is a data structure that (1) supports edge insertions and deletions and (2) answers problem specific queries. The time complexity of (1) and (2) are referred to as the update time and the query time respectively. There are many researches on dynamic graphs whose update time and query time are o(|G|), that is, sublinear in the graph size. However, almost all such researches a...
متن کاملFast, Optimal Pathfinding with Compressed Path Databases
Most existing pathfinding methods are based on runtime search. Numerous enhancements have been introduced in recent years, including hierarchical abstraction (Botea, Müller, and Schaeffer 2004; Sturtevant and Buro 2005), more informed heuristics (Björnsson and Halldórsson 2006; Cazenave 2006; Sturtevant et al. 2009), and symmetry reduction (Harabor and Botea 2010; Harabor and Grastien 2011). Re...
متن کاملUltra-Fast Optimal Pathfinding without Runtime Search
Pathfinding is important in many applications, including games, robotics and GPS itinerary planning. In games, most pathfinding methods rely on runtime search. Despite numerous enhancements introduced in recent years, runtime search has the disadvantage that, in bad cases, most parts of a map need to be explored, causing a time performance degradation. In this work we explore a significantly di...
متن کاملFast and Memory-Efficient Multi-Agent Pathfinding
Multi-agent path planning has been shown to be a PSPACEhard problem. Running a complete search such as A* at the global level is often intractable in practice, since both the number of states and the branching factor grow exponentially as the number of mobile units increases. In addition to the inherent difficulty of the problem, in many real-life applications such as computer games, solutions ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Distributed Sensor Networks
سال: 2015
ISSN: 1550-1477,1550-1477
DOI: 10.1155/2015/238727